Path graph

Results: 1083



#Item
381Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing C. Borgsa , J.T. Chayesa , L. Lov´asza∗, V.T. S´osb†, K. Vesztergombic a b

Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing C. Borgsa , J.T. Chayesa , L. Lov´asza∗, V.T. S´osb†, K. Vesztergombic a b

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2007-01-31 16:12:19
382Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k

Efficient Algorithms for Eulerian Extension and Rural Postman∗ Frederic Dorn† Hannes Moser‡¶ Mathias Weller§k

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2013-01-23 08:47:12
383On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi

On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi

Add to Reading List

Source URL: www.cim.mcgill.ca

Language: English - Date: 2013-05-18 17:31:04
384Confluence in Data Reduction: Bridging Graph Transformation and Kernelization∗ Hartmut Ehrig Claudia Ermel Falk H¨ uffner†

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization∗ Hartmut Ehrig Claudia Ermel Falk H¨ uffner†

Add to Reading List

Source URL: www.user.tu-berlin.de

Language: English - Date: 2013-01-21 07:14:53
385k-Cographs are Kruskalian

k-Cographs are Kruskalian

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-16 14:46:21
386Longest Paths in Planar DAGs in Unambiguous Log-Space

Longest Paths in Planar DAGs in Unambiguous Log-Space

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 16:29:35
387More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs Paolo Boldi∗ and Sebastiano Vigna† Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy  Abstract A graph G w

More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs Paolo Boldi∗ and Sebastiano Vigna† Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy Abstract A graph G w

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2002-05-18 04:50:51
388Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem

Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-04-18 21:30:54
389Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1

Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2012-09-21 09:31:02
390Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin

Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2006-02-25 23:20:28